Hook Lengths and 3-cores

نویسندگان

  • GUO-NIU HAN
  • KEN ONO
چکیده

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that a(n) = 0 if and only if b(n) = 0, where integers a(n) and b(n) are defined by

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Conjectures and Open Problems on Partition Hook Lengths

Abstract. We present some conjectures and open problems on partition hook lengths, which are all motivated by known results on the subject. The conjectures are suggested by extensive experimental calculations using a computer algebra system. The first conjecture unifies two classical results on the number of standard Young tableaux and the number of pairs of standard Young tableaux of the same ...

متن کامل

m at h . N T ] 1 6 M ay 2 00 8 HOOK LENGTHS AND 3 - CORES

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that a(n) = 0 if and only if b(n) = 0, where integers a(n) and b(n) are defined by

متن کامل

The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications

— The paper is devoted to the derivation of the expansion formula for the powers of the Euler Product in terms of partition hook lengths, discovered by Nekrasov and Okounkov in their study of the Seiberg-Witten Theory. We provide a refinement based on a new property of t-cores, and give an elementary proof by using the Macdonald identities. We also obtain an extension by adding two more paramet...

متن کامل

Generalized Hook Lengths in Symbols and Partitions

In this paper we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the symbol. We list some applications, for example to the well-known hook lengths in integer partitions. This leads in particular to a generalization of a relati...

متن کامل

A theorem on the cores of partitions

Suppose that s, t ∈ N are relatively prime positive integers. In the study of block inclusions between sand t-blocks of partitions [4] we introduced an (s, t)-abacus to study relations between sand t-cores of partitions. This is because the cores determine the blocks. Before we state our main result let us mention that the basic facts about partitions, hooks and blocks of partitions may be foun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008